#include "BinarySearchTree.h"

int main()
{
	BSTree<int> b1;
	int a[] = { 4,8,2,5,0,7,3,1,6,9 };
	for (int x : a)
	{
		b1.insert(x);
	}

	b1.Inorder();
	cout << endl;

	/*b1.erase(4);
	b1.Inorder();
	cout << endl;*/

	for (int x : a)
	{
		b1.erase(x);
		b1.Inorder();
		cout << endl;
	}
	return 0;
}